Constraint-Based Layout-Driven Sizing of Analog Circuits
نویسندگان
چکیده
منابع مشابه
Constraint-Driven Diagram Layout
Taking both perceptual organization and aesthetic criteria into account is the key to high-quality diagram layout, but makes for a more di cult problem than pure aesthetic layout. Computing the layout of a network diagram that exhibits a speci ed perceptual organization can be phrased as a constraint-satisfaction problem. Some constraints are derived from the perceptual-organization speci catio...
متن کاملA Constraint-Driven Placement Methodology for Analog Integrated Circuits
A new constraint-driven methodology for the placement of analog IC's is described. Electrical performance speciications are automatically translated into constraints on the layout parasitics. These constraints and the sensitivity information of the circuit are then used to control a Simulated Annealing-based placement algorithm. At each step of the annealing a fast check on performance degradat...
متن کاملLayout Driven Synthesis of Lattice Circuits
When the design process of digital circuits is carried out in individual step (like logic minimization, mapping and routing) we may suffer quality loss. Typical examples thereof are cases where a highly optimized netlist fits badly onto the target architecture or when interconnection delays violate the given timing constraints. Therefore we seek a unified synthesis methodology, allowing the log...
متن کاملLayout Driven Synthesis of Lattice Circuits
When the design process of digital circuits is carried out in individual step (like logic minimization, mapping and routing) we may suffer quality loss. Typical examples thereof are cases where a highly optimized netlist fits badly onto the target architecture or when interconnection delays violate the given timing constraints. Therefore we seek a unified synthesis methodology, allowing the log...
متن کاملA Hybrid GA-SQP Algorithm for Analog Circuits Sizing
This study presents a hybrid algorithm obtained by combining a genetic algorithm (GA) with successive quadratic sequential programming (SQP), namely GA-SQP. GA is the main optimizer, whereas SQP is used to refine the results of GA, further improving the solution quality. The problem formulation is done in the framework named RUNE (fRamework for aUtomated aNalog dEsign), which targets solving no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2011
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2011.2158732